The Equivalent Conversion between Regular Grammar and Finite Automata

Regular Languages and Finite Automata

Regular Languages and Finite Automata

In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying the behavior of the nervous systems. Following up on the ideas of McCulloch and Pitts, Kleene [3] wrote the first paper on finite automata and regular expressions. A finite automaton can be considered as the simplest machine model in that the machine has a finite memory; that is, the memory size is independent ...

Regular Expressions into Finite Automata

It is a well-established fact that each regular expression can be transformed into a non-deterministic nite automaton (NFA) with or without-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi 4] have shown that the construction of an-free NFA due to Glushkov 10] is a natural representation of the regular expression, because it can be des...

Conversion of regular expressions into realtime automata

We consider conversions of regular expressions into k-realtime finite state automata, i.e., automata in which the number of consecutive uses of ε-transitions, along any computation path, is bounded by a fixed constant k. For 2-realtime automata, i.e., for automata that cannot change the state, without reading an input symbol, more than two times in a row, we show that the conversion of a regula...

A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata

Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata. The aim of the paper is to design a novel algorithm for constructing  -free non-deterministic finite automata from the shuffling of regular expressions. Non-determ...